Generating a Slot Assignment Rule for Outbound Containers Having Imprecise Weight Information

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Continuous Updating Rule for Imprecise Probabilities

The paper studies the continuity of rules for updating imprecise probability models when new data are observed. Discontinuities can lead to robustness issues: this is the case for the usual updating rules of the theory of imprecise probabilities. An alternative, continuous updating rule is introduced.

متن کامل

Generating Configurable Containers for Component-Based Software

Existing container-based development strategies provide solutions to the problem of encapsulating cross-cutting concerns in component-based software systems. These approaches fall short, however, in enabling tractable reasoning. To extend existing work in reasoning about parameterized components to container-based approaches, we view containers as parameterized components. We present a model of...

متن کامل

Light-weight Containers

This development provides a framework for container types like sets and maps such that generated code implements these containers with different (efficient) data structures. Thanks to type classes and refinement during code generation, this light-weight approach can seamlessly replace Isabelle’s default setup for code generation. Heuristics automatically pick one of the available data structure...

متن کامل

A Near-optimal Slot Assignment Algorithm for RFID Reader Networks

In this paper, we propose a method that reduces the cycle time of RFID reader networks by overlapping slots. A mathematical formulation of the problem is specified and an effective heuristic algorithm is developed.

متن کامل

EasyMAC: A New and Simple Protocol for Slot Assignment

We give a new distributed algorithm EasyMAC for the slot assignment for media access control (MAC) of nodes in a sensor network. Our algorithm reduces both the number of messages and the time required to complete the slot assignment compared to existing algorithms. We achieve this by maintaining additional information at each node about the collisions that it detects and sending that informatio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Korean navigation and port research

سال: 2005

ISSN: 1598-5725

DOI: 10.5394/kinpr.2005.29.6.573